Construction of color codes from polygons
نویسندگان
چکیده
منابع مشابه
Small polygons and toric codes
We describe two different approaches to making systematic classifications of plane lattice polygons, and recover the toric codes they generate, over small fields, where these match or exceed the best known minimum distance. This includes a [36, 19, 12]-code over F7 whose minimum distance 12 exceeds that of all previously known codes.
متن کاملConstruction of digital nets from BCH-codes
We establish a link between the theory of error-correcting codes and the theory of (t, m, s)-nets. This leads to the fundamental problem of net embeddings of linear codes. Our main result is the construction of four infinite families of digital (t, m, s)-nets based on BCH-codes.
متن کاملA Linear-time Construction of Reuleaux Polygons
The relation between planar geometric graphs which are full equi-intersectors and Reuleaux polygons is studied. It is shown that there is a one-to-one correspondence between these objects. This is used to present exhaustive constructions of Reuleaux polygons of arbitrary (odd) order n. The obvious construction is running in quadratic time, but more careful investigations lead to a reened versio...
متن کاملCombinatorial Construction of Some Near Polygons
We give a construction which takes a rank two incidence geometry with three points on a line and returns a geometry of the same type, i.e., with three points on a line. It is also demonstrated that embeddings of the original geometry can be extended to the new geometry. It is shown that the family of dual polar spaces of type Sp(2n, 2) arise recursively from the construction starting with the g...
متن کاملExact and approximate construction of offset polygons
The Minkowski sum of two sets A, B ∈ R2, denoted A ⊕ B, is defined as {a + b | a ∈ A, b ∈ B}. We describe an efficient and robust implementation of the construction of the Minkowski sum of a polygon in R2 with a disc, an operation known as offsetting the polygon. Our software package includes a procedure for computing the exact offset of a straight-edge polygon, based on the arrangement of coni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics Communications
سال: 2018
ISSN: 2399-6528
DOI: 10.1088/2399-6528/aad062